Study of ?? Networks via Zagreb Connection Indices

Graph theory can be used to optimize interconnection network systems. The compatibility of such networks mainly depends on their topology. Topological indices may characterize the topology networks. In this work, we studied a symmetric ?? formed by ? time repetition process joining ? copies selected graph ? in way that corresponding vertices all are joined with each other new edge. symmetry is ensured involvement complete K? construction process. free hand choose an initial and formation chemical graphs using ??? enhance its importance as family which covers pre-defined graphs, along space for possibly way. We Zagreb connection characterization ???. These have gained worth field very small duration due predictive power enthalpy, entropy, acentric factor. computations mathematically novel assist topological enable emerging use.